Proof - Theoretic Reduction as a Philosopher ’ S Tool
نویسنده
چکیده
Hilbert’s program in the philosophy of mathematics comes in two parts. One part is a technical part. To carry out this part of the program one has to prove a certain technical result. The other part of the program is a philosophical part. It is concerned with philosophical questions that are the real aim of the program. To carry out this part one, basically, has to show why the technical part answers the philosophical questions one wanted to have answered. Hilbert probably thought that he had completed the philosophical part of his program, maybe up to a few details. What was left to do was the technical part. To carry it out one, roughly, had to give a precise axiomatization of mathematics and show that it is consistent on purely finitistic grounds. This would come down to giving a relative consistency proof of mathematics in finitist mathematics, or to give a proof-theoretic reduction of mathematics on to finitist mathematics (we will look at these notions in more detail soon). It is widely believed that Gödel’s theorems showed that the technical part of Hilbert’s program could not be carried out. Gödel’s theorems show that the consistency of arithmetic can not even be proven in arithmetic, not to speak of by finitistic means alone. So, the technical part of Hilbert’s program is hopeless, and since Hilbert’s program essentially relied on both the technical and the philosophical part, Hilbert’s program as a whole is hopeless. Justified as this attitude is, it is a bit unfortunate. It is unfortunate because it takes away too much attention from the philosophical part of Hilbert’s program. And this is unfortunate for two reasons. First, because it is not at all clear what the philosophical part of Hilbert’s program comes down to. What of philosophical importance about mathematics would Hilbert have shown if the technical part of his program would have worked? Secondly, because even though the technical part of Hilbert’s original program is hopeless, there are modified versions of Hilbert’s program that do not have the technical difficulties that Hilbert’s original program has. In fact, for so-called relativized versions of Hilbert’s program the technical parts are known to work.1 However, the people working on the technical results related to relativized versions of Hilbert’s program have
منابع مشابه
Investigation of the Efficacy of Damp-Proof Montmorillonite Nanoclay for Radon Reduction Strategies in Radon Prone Areas of Ramsar
Background: Ramsar, a northern city in Iran, lies on the coast of the Caspian Sea. This city has areas with some of the highest levels of natural radiation measured to date. The radon concentration in some areas of Ramsar is up to 3700 Bq m–3. On the other hand, due to high level of humidity, damp-proof barriers should be used in construction of new buildings in radon prone areas of this cit...
متن کاملFormalization and Verification of Number Theoretic Algorithms Using the Mizar Proof Checker
In this paper, we introduce formalization of well-known number theoretic algorithms on the Mizar proof checking system. We formalized the Euclidean algorithm, the extended Euclidean algorithm and the algorithm computing the solution of the Chinese reminder theorem based on the source code of NZMATH which is a Python based number theory oriented calculation system. We prove the accuracy of our f...
متن کاملCombinatorial Aspects of Szemerédi ’ S Theorem
In the first section we review the beautiful combinatorial theory of Ramsey as well as the history of Szemerédi’s theorem. In Section 2 we give a sketch of Ruzsa’s modern proof of Freiman’s theorem on sumsets which plays an important role in Gowers’ quantitative proof of Szemerédi’s theorem. In the last section we deduce Roth’s theorem (Szemerédi’s theorem in the case k=3) from the Triangle Rem...
متن کاملSubject Reduction of Logic Programs as Proof-Theoretic Property
We consider prescriptive type systems for logic programs (as in Gödel or Mercury). In such systems, the typing is static, but it guarantees an operational property: if a program is “well-typed”, then all derivations starting in a “well-typed” query are again “well-typed”. This property has been called subject reduction. We show that this property can also be phrased as a property of the proof-t...
متن کاملA Proof Theoretic Interpretation of Model Theoretic Hiding
Logical frameworks like LF are used for formal representations of logics in order to make them amenable to formal machine-assisted meta-reasoning. While the focus has originally been on logics with a proof theoretic semantics, we have recently shown how to define model theoretic logics in LF as well. We have used this to define new institutions in the Heterogeneous Tool Set in a purely declarat...
متن کامل